The transportation problem with exclusionary side constraints
نویسندگان
چکیده
منابع مشابه
The transportation problem with exclusionary side constraints
We consider the so-called Transportation Problem with Exclusionary Side Constraints (TPESC), which is a generalization of the ordinary transportation problem. We confirm that the TPESC is NP -hard, and we analyze the complexity of different special cases. For instance, we show that in case of a bounded number of suppliers, a pseudo-polynomial time algorithm exists, whereas the case of two deman...
متن کاملThe transportation problem with exclusionary side constraints ∗ Dries Goossens † and Frits
We consider the so-called Transportation Problem with Exclusionary Side Constraints (TPESC), which is a generalization of the ordinary transportation problem. We determine the complexity status for each of two special cases of this problem, by proving NP-completeness, and by exhibiting a pseudo-polynomial time algorithm. For the general problem, we show that it cannot be approximated with a con...
متن کاملMaximal covering location-allocation problem with M/M/k queuing system and side constraints
We consider the maximal covering location-allocation problem with multiple servers. The objective is to maximize the population covered, subject to constraints on the number of service centers, total number of servers in all centers, and the average waiting time at each center. Each center operates as an M/M/k queuing system with variable number of servers. The total costs of establishing cen...
متن کاملFuzzy Multi-Objective Capacitated Transportation Problem with Mixed Constraints
In this article a capacitated transportation problem is considered which is formulated as a multi objective capacitated transportation problem with mixed constraints. To determine the optimum compromise solution of multi objective capacitated transportation problem (MOCTP) with mixed constraints a Fuzzy multi objective programming approach has been applied in which we use three different forms ...
متن کاملTwo-stage Interval Time Minimization Transportation Problem with Capacity Constraints
This paper discusses a two-stage interval time minimization transportation problem with capacity constraints on each source-destination link. In the current problem, the exact total demand of all the destinations lies in an interval whose end points are equal to the minimum and the maximum total available amount of the homogeneous product (which is being transported), at the sources. The minimu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: 4OR
سال: 2008
ISSN: 1619-4500,1614-2411
DOI: 10.1007/s10288-007-0067-z